Multiship Crane Sequencing with Yard Congestion Constraints

نویسندگان

  • Shawn Choo
  • Diego Klabjan
  • David Simchi-Levi
چکیده

Crane sequencing in container terminals determines the order of ship discharging and loading jobs that quay cranes (QCs) perform so that the duration of vessels’ stay is minimized. The ship’s load profile, berthing time, number of available bays and QCs are considered. More importantly, clearance and yard congestion constraints need to be included, which respectively ensure that a minimum distance between adjacent QCs is observed and yard storage blocks are not overly accessed at any point in time. In sequencing for a single ship, a mixed integer programming model is proposed and a heuristic approach based on the model is developed that produces good solutions. The model is then reformulated as a generalized set covering problem and solved exactly by branch-and-price. For multi-ship sequencing, the yard congestion constraints are relaxed in the spirit of Lagrangian relaxation so that the problem decomposes by vessel into smaller sub-problems solved by branch-and-price. An efficient primal heuristic is also designed. Computational experiments reveal that large-scale problems can be solved in a reasonable computational time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yard crane scheduling in port container terminals using genetic algorithm

Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...

متن کامل

Yard Crane Pools and Optimum Layouts for Storage Yards of Container Terminals

As more and more container terminals open up all over the world, competition for business is becoming very intense for container terminal operators. They are finding out that even to keep their existing Sea Line customers, they have to make them happy by offering higher quality service. The quality of service they can provide depends on their operating policies and the design of the terminal la...

متن کامل

Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

متن کامل

A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Transportation Science

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2010